Least squares fitting of circles and lines

نویسندگان

  • Nikolai I. Chernov
  • Claire Lesort
چکیده

We study theoretical and computational aspects of the least squares fit (LSF) of circles and circular arcs. First we discuss the existence and uniqueness of LSF and various parametrization schemes. Then we evaluate several popular circle fitting algorithms and propose a new one that surpasses the existing methods in reliability. We also discuss and compare direct (algebraic) circle fits.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extraction of Circles from Arcs Segmented into Short Straight Lines

paper presents a new method that is capable of extracting circles from complicated and heavily corrupted images, which is not based on the Hough transform (HT). The proposed method consists of three parts. First, we approximately detect short straight lines from the image by using a fast line extraction algorithm. Second, it uses a least squares fitting algorithm for arc segments. The arc segme...

متن کامل

A New Fast and Robust Circle Extraction Algorithm

This paper presents a new algorithm that is capable of extracting circles from complicated and heavily corrupted images. The algorithm uses a least-squares fitting algorithm for arc segments. The arcs are segmented by using the short straight lines which are extracted by a fast line extraction algorithm. The arc segments are used to yield accurate circle parameters. Tests performed on synthetic...

متن کامل

Fitting geometric curves to observed data

Contents Preface v Chapter 1. Introduction and historic overview 1 1.1. Classical regression 1 1.2. Errors-in-variables (EIV) model 3 1.3. Geometric fit 5 1.4. Solving a general EIV problem 8 1.5. Non-linear nature of the 'linear' EIV 11 1.6. Statistical properties of the orthogonal fit 13 1.7. Relation to total least squares (TLS) 15 1.8. Nonlinear models 16 1.9. Notation and preliminaries 17 ...

متن کامل

Evaluation of One- and Two-sided Geometric

Recent work in testing and comparing maximum-inscribed, minimum-circumscribed, and minimum-zone (Chebyshev) fitting algorithms indicates that serious problems can exist in present commercial software packages. 1. Introduction The historical motivation for this work came as a result of the 1988 GIDEP alert [1] which warned of possible significant measurement uncertainty arising from least-square...

متن کامل

Microsoft Word - john_icita_ell.rtf

-In this paper, we present a fast and robust ellipse extraction method. The proposed method can extract ellipses with high accuracy and speed from images with complicated backgrounds. It consists of two parts. First, we extract arc segments from an ellipse approximated by short straight lines that are extracted by a fast line extraction algorithm. Second, the arc segments are used to calculate ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره cs.CV/0301001  شماره 

صفحات  -

تاریخ انتشار 2003